Active Pixel Merging on Hypercube Multicomputers
نویسندگان
چکیده
This paper presents algorithms developed for pixel merging phase of object space parallel polygon rendering on hypercube connected multicomputers These algorithms reduce volume of communication in pixel merging phase by only exchanging local foremost pixels In order to avoid message fragmentation local foremost pixels should be stored in consecutive memory locations An algorithm called modi ed scanline z bu er is proposed to store local foremost pixels e ciently This algo rithm also avoids the initialization of scanline z bu er for each scanline on the screen Good processor utilization is achieved by subdividing the image space among the processors in pixel merging phase E cient algo rithms for load balancing in the pixel merging phase are also proposed and presented Experimental results obtained on a processor Intel s iPSC hypercube multicomputer are presented
منابع مشابه
Object-space parallel polygon rendering on hypercubes
ÐThis paper presents algorithms for object-space parallel polygon rendering on hypercube-connected multicomputers. A modi®ed scanline z-buer algorithm is proposed for local rendering phase. The proposed algorithm avoids message fragmentation by packing local foremost pixels in consecutive memory locations eciently, and it eliminates the initialization of scanline z-buer for each scanline. Se...
متن کاملExecuting Algorithms with Hypercube Topology on Torus Multicomputers
Many parallel algorithms use hypercubes as the communication topology among their processes. When such algorithms are executed on hypercube multicomputers the communication cost is kept minimum since processes can be allocated to processors in such a way that only communication between neighbor processors is required. However, the scalability of hypercube multicomputers is constrained by the fa...
متن کاملImage Template Matching on MIMD Hypercube Multicomputers
Efficient algorithms for image template matching on fine grained as well as medium grained MIMD hypercube multicomputers are developed. The medium grained MIMD algorithm is developed specifically for the NCUBE multicomputer. This algorithm is compared experimentally with an algorithm that is optimized for the Cray 2 supercomputer.
متن کاملSynchronous Load Balancing in Hypercube Multicomputers with Faulty Nodes
This paper presents a new dynamic load-balancing algorithm for hypercube multicomputers with faulty nodes. The emphasis in our method is on obtaining global load information and performing task migration using ``short paths'' in a synchronous manner so that a minimal amount of communication overhead is required. To accomplish this, we present an algorithm for constructing a new logical topology...
متن کاملEfficient Implementation of Barrier Synchronization in Wormhole-Routed Hypercube Multicomputers
This paper addresses eecient implementation of barrier synchronization in wormhole-routed hypercube multicomputers. For those systems supporting only unicast communication in hardware, a novel software tree approach, the U-cube tree, is proposed. An important feature of the U-cube tree is that all messages injected into the network are guaranteed to be contention-free. Performance measurements ...
متن کامل